A Visualizable Test Problem Generator for Many-Objective Optimization

نویسندگان

چکیده

Visualizing the search behavior of a series points or populations in their native domain is critical understanding biases and attractors an optimization process. Distance-based many-objective test problems have been developed to facilitate visualization 2-D design space with arbitrarily many objective functions. Previous works proposed few commonly seen problem characteristics into this framework, such as definition disconnected Pareto sets dominance resistant regions space. The authors’ previous work has advanced research further by providing generator automatically create user-defined instances featuring any combination these features well newly introduced ones, landscape discontinuities, varying ranges, neutrality. This makes number additional contributions including proposal enhanced, open-source feature-rich that can exhibiting range features—some which are here form extensions existing features. A comprehensive validation also provided using popular multiobjective algorithms, some settings different challenges for optimizer identified.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

solution of security constrained unit commitment problem by a new multi-objective optimization method

چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...

Test Problem Construction for Single-Objective Bilevel Optimization

In this paper, we propose a procedure for designing controlled test problems for single-objective bilevel optimization. The construction procedure is flexible and allows its user to control the different complexities that are to be included in the test problems independently of each other. In addition to properties that control the difficulty in convergence, the procedure also allows the user t...

متن کامل

Solving a new bi-objective model for a cell formation problem considering labor allocation by multi-objective particle swarm optimization

Mathematical programming and artificial intelligence (AI) methods are known as the most effective and applicable procedures to form manufacturing cells in designing a cellular manufacturing system (CMS). In this paper, a bi-objective programming model is presented to consider the cell formation problem that is solved by a proposed multi-objective particle swarm optimization (MOPSO). The model c...

متن کامل

A New Evolutionary Decision Theory for Many-Objective Optimization Problems

In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that all objectives have equal importance. The key contribution of this paper is the discovery of the new definition of optimality called ε-optimality for MOP that is based on a new conception, so called ε-dominance, which...

متن کامل

A Comparative Study on Evolutionary Algorithms for Many-Objective Optimization

Many-objective optimization has been gaining increasing attention in the evolutionary multiobjective optimization community, and various approaches have been developed to solve many-objective problems in recent years. However, the existing empirically comparative studies are often restricted to only a few approaches on a handful of test problems. This paper provides a systematic comparison of e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Evolutionary Computation

سال: 2022

ISSN: ['1941-0026', '1089-778X']

DOI: https://doi.org/10.1109/tevc.2021.3084119